________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 21:07:09
Input Data from:  dataset150.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,1615
Average f[i]   :4700
Average g[i,j] :2080,55555555556
Total demand   :10570
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 55
> Selected Move:	3620	1	-1	2	5500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3620


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 54
> Selected Move:	4990	1	-1	17	11000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0    >new incumb.: 4990


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 35
> Selected Move:	5930	1	-1	5	17000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0    >new incumb.: 5930


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 38
> Selected Move:	6930	1	-1	10	22500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0    >new incumb.: 6930


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 36
> Selected Move:	7140	3	0	19	24800


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  2    >new incumb.: 7140


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 28
> Selected Move:	7490	3	5	16	23300


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  2    >new incumb.: 7490


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 23
> Selected Move:	7490	4	19	2	21800


> New Y[]: 
	
	 0  3  2  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 25
> Selected Move:	7526	1	-1	6	26300


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  0  0  1  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 12
> Selected Move:	8060	3	10	15	24800


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  0  0  0  0  0  0  0  1  1  1  0  1    >new incumb.: 8060


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 13
> Selected Move:	8060	4	2	6	25000


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 13
> Selected Move:	8064	3	6	4	25200


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 26
> Selected Move:	8090	3	17	7	24200


> New Y[]: 
	
	 0  3  1  0  2  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1    >new incumb.: 8090


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 21
> Selected Move:	8180	3	4	3	24900


> New Y[]: 
	
	 0  3  1  2  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1    >new incumb.: 8180


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 19
> Selected Move:	8040	4	3	2	25300


> New Y[]: 
	
	 0  3  2  1  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 20
> Selected Move:	7952	3	3	4	25300


> New Y[]: 
	
	 0  3  2  0  1  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 22
> Selected Move:	7920	3	16	9	24800


> New Y[]: 
	
	 0  3  2  0  1  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 13
> Selected Move:	7920	4	2	4	23700


> New Y[]: 
	
	 0  3  1  0  2  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 27
> Selected Move:	7920	3	7	12	24700


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 23
> Selected Move:	8072	3	9	16	25200


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 22
> Selected Move:	8040	3	4	6	25000


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 16
> Selected Move:	8040	4	6	2	24800


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 17
> Selected Move:	8040	4	2	12	24700


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  0  0  2  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 23
> Selected Move:	8060	3	12	17	24500


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  0  0  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 17
> Selected Move:	7936	4	17	16	25300


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  0  0  0  0  0  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 23
> Selected Move:	7917	3	17	12	25300


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  0  0  1  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 28
> Selected Move:	7870	3	12	7	24300


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  0  0  0  0  0  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 29
> Selected Move:	7870	4	16	2	23800


> New Y[]: 
	
	 0  3  2  0  0  0  1  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 34
> Selected Move:	7870	4	2	6	24000


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 35
> Selected Move:	7870	4	6	7	24400


> New Y[]: 
	
	 0  3  1  0  0  0  1  2  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 29
> Selected Move:	7834	3	6	3	25900


> New Y[]: 
	
	 0  3  1  1  0  0  0  2  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 19
> Selected Move:	7876	4	7	16	25800


> New Y[]: 
	
	 0  3  1  1  0  0  0  1  0  0  0  0  0  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 29
> Selected Move:	7790	3	3	4	25800


> New Y[]: 
	
	 0  3  1  0  1  0  0  1  0  0  0  0  0  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,38

## ITERATION 32 #######################


> Neighbours evaluated; 21
> Selected Move:	7748	4	16	7	25900


> New Y[]: 
	
	 0  3  1  0  1  0  0  2  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,385

## ITERATION 33 #######################


> Neighbours evaluated; 31
> Selected Move:	7775	3	7	17	26000


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  0  0  0  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 34 #######################


> Neighbours evaluated; 20
> Selected Move:	7860	3	4	3	26000


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  0  0  0  0  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,395

## ITERATION 35 #######################


> Neighbours evaluated; 17
> Selected Move:	7895	4	17	3	25900


> New Y[]: 
	
	 0  3  1  2  0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,4

## ITERATION 36 #######################


> Neighbours evaluated; 20
> Selected Move:	7890	3	17	12	25900


> New Y[]: 
	
	 0  3  1  2  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 37 #######################


> Neighbours evaluated; 26
> Selected Move:	7764	4	3	12	26200


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  0  0  0  0  2  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 38 #######################


> Neighbours evaluated; 23
> Selected Move:	7717	4	12	2	26300


> New Y[]: 
	
	 0  3  2  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 39 #######################


> Neighbours evaluated; 24
> Selected Move:	7711	3	12	17	26300


> New Y[]: 
	
	 0  3  2  1  0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 40 #######################


> Neighbours evaluated; 18
> Selected Move:	7670	3	3	7	24800


> New Y[]: 
	
	 0  3  2  0  0  0  0  1  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 41 #######################


> Neighbours evaluated; 34
> Selected Move:	7720	3	2	4	24200


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 42 #######################


> Neighbours evaluated; 29
> Selected Move:	7720	4	4	17	25000


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  0  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 43 #######################


> Neighbours evaluated; 24
> Selected Move:	7720	3	16	9	24500


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  1  0  0  0  0  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 44 #######################


> Neighbours evaluated; 11
> Selected Move:	7720	4	17	4	23700


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 45 #######################


> Neighbours evaluated; 13
> Selected Move:	7880	3	7	2	24700


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 46 #######################


> Neighbours evaluated; 21
> Selected Move:	7830	3	4	6	24500


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,435

## ITERATION 47 #######################


> Neighbours evaluated; 11
> Selected Move:	7830	4	6	2	24300


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 48 #######################


> Neighbours evaluated; 9
> Selected Move:	7830	4	2	17	24000


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,425

## ITERATION 49 #######################


> Neighbours evaluated; 19
> Selected Move:	7728	3	15	10	25500


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 50 #######################


> Neighbours evaluated; 14
> Selected Move:	7750	3	9	16	26000


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  0  0  0  0  0  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 51 #######################


> Neighbours evaluated; 21
> Selected Move:	7622	3	17	12	26200


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  0  2  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 52 #######################


> Neighbours evaluated; 25
> Selected Move:	7587	4	12	2	26300


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  0  0  1  0  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 53 #######################


> Neighbours evaluated; 21
> Selected Move:	7829	3	12	7	25300


> New Y[]: 
	
	 0  3  2  0  0  0  1  1  0  0  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 54 #######################


> Neighbours evaluated; 22
> Selected Move:	7786	4	2	10	25400


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  0  0  2  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 55 #######################


> Neighbours evaluated; 22
> Selected Move:	7743	4	10	6	25500


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  0  0  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 56 #######################


> Neighbours evaluated; 18
> Selected Move:	7896	3	6	4	25700


> New Y[]: 
	
	 0  3  1  0  2  0  0  1  0  0  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 57 #######################


> Neighbours evaluated; 26
> Selected Move:	7685	3	4	3	26400


> New Y[]: 
	
	 0  3  1  2  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 58 #######################


> Neighbours evaluated; 27
> Selected Move:	7593	3	16	9	25900


> New Y[]: 
	
	 0  3  1  2  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 59 #######################


> Neighbours evaluated; 21
> Selected Move:	7870	3	10	15	24400


> New Y[]: 
	
	 0  3  1  2  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 60 #######################


> Neighbours evaluated; 19
> Selected Move:	7870	4	3	2	24800


> New Y[]: 
	
	 0  3  2  1  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 61 #######################


> Neighbours evaluated; 24
> Selected Move:	7692	4	2	7	25400


> New Y[]: 
	
	 0  3  1  1  0  0  0  2  0  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 62 #######################


> Neighbours evaluated; 21
> Selected Move:	7740	3	3	4	25400


> New Y[]: 
	
	 0  3  1  0  1  0  0  2  0  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 63 #######################


> Neighbours evaluated; 25
> Selected Move:	7670	3	4	17	24900


> New Y[]: 
	
	 0  3  1  0  0  0  0  2  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 64 #######################


> Neighbours evaluated; 20
> Selected Move:	7750	3	7	0	23000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 65 #######################


> Neighbours evaluated; 23
> Selected Move:	7970	3	1	3	25000


> New Y[]: 
	
	 2  0  1  3  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,47

## ITERATION 66 #######################


> Neighbours evaluated; 20
> Selected Move:	7923	4	3	17	25100


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  0  1  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,475

## ITERATION 67 #######################


> Neighbours evaluated; 20
> Selected Move:	7912	3	3	14	25100


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  0  0  0  0  1  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 68 #######################


> Neighbours evaluated; 21
> Selected Move:	7830	3	14	6	23600


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 69 #######################


> Neighbours evaluated; 12
> Selected Move:	7980	3	0	16	25400


> New Y[]: 
	
	 0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  1  2  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,48

## ITERATION 70 #######################


> Neighbours evaluated; 3
> Selected Move:	8170	4	16	2	24900


> New Y[]: 
	
	 0  0  2  0  0  0  1  0  0  1  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 71 #######################


> Neighbours evaluated; 7
> Selected Move:	8170	4	2	17	24800


> New Y[]: 
	
	 0  0  3  0  0  0  1  0  0  1  0  0  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,48

## ITERATION 72 #######################


> Neighbours evaluated; 8
> Selected Move:	8170	3	17	12	25000


> New Y[]: 
	
	 0  0  3  0  0  0  1  0  0  1  0  0  2  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 73 #######################


> Neighbours evaluated; 14
> Selected Move:	8075	4	2	12	25200


> New Y[]: 
	
	 0  0  2  0  0  0  1  0  0  1  0  0  3  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 74 #######################


> Neighbours evaluated; 10
> Selected Move:	7982	4	2	6	25400


> New Y[]: 
	
	 0  0  1  0  0  0  2  0  0  1  0  0  3  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 75 #######################


> Neighbours evaluated; 14
> Selected Move:	8122	3	12	17	25100


> New Y[]: 
	
	 0  0  1  0  0  0  2  0  0  1  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,48

## ITERATION 76 #######################


> Neighbours evaluated; 10
> Selected Move:	8026	4	17	2	25300


> New Y[]: 
	
	 0  0  3  0  0  0  2  0  0  1  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 77 #######################


> Neighbours evaluated; 10
> Selected Move:	8024	3	17	12	25300


> New Y[]: 
	
	 0  0  3  0  0  0  2  0  0  1  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 78 #######################


> Neighbours evaluated; 16
> Selected Move:	8000	3	12	7	24300


> New Y[]: 
	
	 0  0  3  0  0  0  2  1  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 79 #######################


> Neighbours evaluated; 25
> Selected Move:	8000	4	6	7	24700


> New Y[]: 
	
	 0  0  3  0  0  0  1  2  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 80 #######################


> Neighbours evaluated; 15
> Selected Move:	8000	4	7	16	24600


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  0  1  0  0  0  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 81 #######################


> Neighbours evaluated; 25
> Selected Move:	7867	3	7	12	25600


> New Y[]: 
	
	 0  0  3  0  0  0  1  0  0  1  0  0  1  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 82 #######################


> Neighbours evaluated; 11
> Selected Move:	7864	3	12	17	25600


> New Y[]: 
	
	 0  0  3  0  0  0  1  0  0  1  0  0  0  0  0  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,515

## ITERATION 83 #######################


> Neighbours evaluated; 15
> Selected Move:	7830	3	16	0	23800


> New Y[]: 
	
	 2  0  3  0  0  0  1  0  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 84 #######################


> Neighbours evaluated; 19
> Selected Move:	7830	4	2	6	25000


> New Y[]: 
	
	 2  0  1  0  0  0  3  0  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 85 #######################


> Neighbours evaluated; 19
> Selected Move:	7920	3	6	13	25000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  0  0  0  3  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 86 #######################


> Neighbours evaluated; 20
> Selected Move:	7752	3	13	14	25400


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  0  0  0  0  3  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,515

## ITERATION 87 #######################


> Neighbours evaluated; 16
> Selected Move:	7806	4	14	2	25300


> New Y[]: 
	
	 2  0  3  0  0  0  0  0  0  1  0  0  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,51

## ITERATION 88 #######################


> Neighbours evaluated; 15
> Selected Move:	8080	3	2	4	25000


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  1  0  0  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,505

## ITERATION 89 #######################


> Neighbours evaluated; 22
> Selected Move:	7850	3	14	16	23500


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  1  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 90 #######################


> Neighbours evaluated; 33
> Selected Move:	7930	3	9	2	25000


> New Y[]: 
	
	 2  0  1  0  3  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,495

## ITERATION 91 #######################


> Neighbours evaluated; 39
> Selected Move:	7930	3	17	12	25000


> New Y[]: 
	
	 2  0  1  0  3  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,49

## ITERATION 92 #######################


> Neighbours evaluated; 44
> Selected Move:	7875	3	4	3	25500


> New Y[]: 
	
	 2  0  1  3  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,485

## ITERATION 93 #######################


> Neighbours evaluated; 36
> Selected Move:	7950	3	12	7	24500


> New Y[]: 
	
	 2  0  1  3  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,48

## ITERATION 94 #######################


> Neighbours evaluated; 41
> Selected Move:	7950	4	3	2	24800


> New Y[]: 
	
	 2  0  3  1  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,475

## ITERATION 95 #######################


> Neighbours evaluated; 50
> Selected Move:	7860	3	3	4	24800


> New Y[]: 
	
	 2  0  3  0  1  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,47

## ITERATION 96 #######################


> Neighbours evaluated; 39
> Selected Move:	7860	4	2	4	24000


> New Y[]: 
	
	 2  0  1  0  3  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,465

## ITERATION 97 #######################


> Neighbours evaluated; 65
> Selected Move:	7680	3	7	11	24000


> New Y[]: 
	
	 2  0  1  0  3  0  0  0  0  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,46

## ITERATION 98 #######################


> Neighbours evaluated; 19
> Selected Move:	7870	3	2	17	24000


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  0  0  1  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,455

## ITERATION 99 #######################


> Neighbours evaluated; 26
> Selected Move:	7870	4	4	17	24600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,45

## ITERATION 100 #######################


> Neighbours evaluated; 25
> Selected Move:	7850	3	11	9	24100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,445

## ITERATION 101 #######################


> Neighbours evaluated; 32
> Selected Move:	7813	3	16	14	25600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  0  0  0  0  1  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 102 #######################


> Neighbours evaluated; 17
> Selected Move:	7750	3	14	11	24100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 103 #######################


> Neighbours evaluated; 15
> Selected Move:	7750	4	17	4	23500


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  1  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 104 #######################


> Neighbours evaluated; 28
> Selected Move:	7795	3	11	13	25500


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  1  0  0  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,425

## ITERATION 105 #######################


> Neighbours evaluated; 14
> Selected Move:	7798	4	4	13	25500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  0  0  0  3  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 106 #######################


> Neighbours evaluated; 21
> Selected Move:	7720	3	13	1	23500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 107 #######################


> Neighbours evaluated; 32
> Selected Move:	7820	3	15	10	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 108 #######################


> Neighbours evaluated; 32
> Selected Move:	7850	3	4	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 109 #######################


> Neighbours evaluated; 22
> Selected Move:	7850	3	9	16	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 110 #######################


> Neighbours evaluated; 27
> Selected Move:	7750	3	10	15	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,395

## ITERATION 111 #######################


> Neighbours evaluated; 35
> Selected Move:	7923	3	1	3	25500


> New Y[]: 
	
	 2  0  1  3  0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 112 #######################


> Neighbours evaluated; 37
> Selected Move:	7886	4	3	17	25600


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,385

## ITERATION 113 #######################


> Neighbours evaluated; 39
> Selected Move:	7830	3	3	6	24100


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,38

## ITERATION 114 #######################


> Neighbours evaluated; 40
> Selected Move:	7882	3	0	14	25600


> New Y[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  2  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,375

## ITERATION 115 #######################


> Neighbours evaluated; 12
> Selected Move:	7913	3	16	9	25100


> New Y[]: 
	
	 0  0  1  0  0  0  1  0  0  1  0  0  0  0  2  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 116 #######################


> Neighbours evaluated; 6
> Selected Move:	7839	4	17	2	25300


> New Y[]: 
	
	 0  0  3  0  0  0  1  0  0  1  0  0  0  0  2  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,375

## ITERATION 117 #######################


> Neighbours evaluated; 10
> Selected Move:	7858	3	17	12	25300


> New Y[]: 
	
	 0  0  3  0  0  0  1  0  0  1  0  0  1  0  2  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 118 #######################


> Neighbours evaluated; 11
> Selected Move:	7818	4	2	12	25400


> New Y[]: 
	
	 0  0  1  0  0  0  1  0  0  1  0  0  3  0  2  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 119 #######################


> Neighbours evaluated; 23
> Selected Move:	7901	3	14	16	25700


> New Y[]: 
	
	 0  0  1  0  0  0  1  0  0  1  0  0  3  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 120 #######################


> Neighbours evaluated; 20
> Selected Move:	7766	3	12	7	25600


> New Y[]: 
	
	 0  0  1  0  0  0  1  3  0  1  0  0  0  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 121 #######################


> Neighbours evaluated; 12
> Selected Move:	7961	4	16	2	25100


> New Y[]: 
	
	 0  0  2  0  0  0  1  3  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 122 #######################


> Neighbours evaluated; 14
> Selected Move:	7880	4	2	6	25300


> New Y[]: 
	
	 0  0  1  0  0  0  2  3  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 123 #######################


> Neighbours evaluated; 21
> Selected Move:	7757	4	7	16	25600


> New Y[]: 
	
	 0  0  1  0  0  0  2  1  0  1  0  0  0  0  0  1  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 124 #######################


> Neighbours evaluated; 19
> Selected Move:	7836	4	6	2	25400


> New Y[]: 
	
	 0  0  2  0  0  0  1  1  0  1  0  0  0  0  0  1  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 125 #######################


> Neighbours evaluated; 17
> Selected Move:	7876	4	16	6	25300


> New Y[]: 
	
	 0  0  2  0  0  0  3  1  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 126 #######################


> Neighbours evaluated; 24
> Selected Move:	7714	3	6	3	25300


> New Y[]: 
	
	 0  0  2  3  0  0  0  1  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 127 #######################


> Neighbours evaluated; 31
> Selected Move:	7755	4	2	3	25200


> New Y[]: 
	
	 0  0  3  2  0  0  0  1  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 128 #######################


> Neighbours evaluated; 41
> Selected Move:	7724	3	16	11	25200


> New Y[]: 
	
	 0  0  3  2  0  0  0  1  0  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 129 #######################


> Neighbours evaluated; 17
> Selected Move:	7810	3	2	17	25000


> New Y[]: 
	
	 0  0  0  2  0  0  0  1  0  1  0  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 130 #######################


> Neighbours evaluated; 5
> Selected Move:	7810	4	3	17	25000


> New Y[]: 
	
	 0  0  0  3  0  0  0  1  0  1  0  1  0  0  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,445

## ITERATION 131 #######################


> Neighbours evaluated; 12
> Selected Move:	7708	3	9	16	25500


> New Y[]: 
	
	 0  0  0  3  0  0  0  1  0  0  0  1  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,45

## ITERATION 132 #######################


> Neighbours evaluated; 11
> Selected Move:	7705	4	3	17	25500


> New Y[]: 
	
	 0  0  0  2  0  0  0  1  0  0  0  1  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,455

## ITERATION 133 #######################


> Neighbours evaluated; 12
> Selected Move:	7680	3	3	4	24800


> New Y[]: 
	
	 0  0  0  0  2  0  0  1  0  0  0  1  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,46

## ITERATION 134 #######################


> Neighbours evaluated; 15
> Selected Move:	7740	3	17	2	25000


> New Y[]: 
	
	 0  0  3  0  2  0  0  1  0  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 135 #######################


> Neighbours evaluated; 20
> Selected Move:	7870	3	4	6	24800


> New Y[]: 
	
	 0  0  3  0  0  0  2  1  0  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 136 #######################


> Neighbours evaluated; 25
> Selected Move:	7823	4	6	16	25100


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  0  0  0  1  0  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 137 #######################


> Neighbours evaluated; 22
> Selected Move:	7775	4	16	7	25200


> New Y[]: 
	
	 0  0  3  0  0  0  1  2  0  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 138 #######################


> Neighbours evaluated; 16
> Selected Move:	7966	3	7	17	25300


> New Y[]: 
	
	 0  0  3  0  0  0  1  0  0  0  0  1  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 139 #######################


> Neighbours evaluated; 8
> Selected Move:	7990	3	16	9	24800


> New Y[]: 
	
	 0  0  3  0  0  0  1  0  0  1  0  1  0  0  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,49

## ITERATION 140 #######################


> Neighbours evaluated; 6
> Selected Move:	7990	4	2	17	24900


> New Y[]: 
	
	 0  0  2  0  0  0  1  0  0  1  0  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,495

## ITERATION 141 #######################


> Neighbours evaluated; 5
> Selected Move:	7940	4	2	6	25100


> New Y[]: 
	
	 0  0  1  0  0  0  2  0  0  1  0  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,5

## ITERATION 142 #######################


> Neighbours evaluated; 8
> Selected Move:	7840	4	17	2	25300


> New Y[]: 
	
	 0  0  3  0  0  0  2  0  0  1  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,505

## ITERATION 143 #######################


> Neighbours evaluated; 8
> Selected Move:	7768	3	17	12	25300


> New Y[]: 
	
	 0  0  3  0  0  0  2  0  0  1  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 144 #######################


> Neighbours evaluated; 12
> Selected Move:	7920	4	6	12	25000


> New Y[]: 
	
	 0  0  3  0  0  0  1  0  0  1  0  1  2  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 145 #######################


> Neighbours evaluated; 14
> Selected Move:	7817	4	2	12	25200


> New Y[]: 
	
	 0  0  2  0  0  0  1  0  0  1  0  1  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 146 #######################


> Neighbours evaluated; 10
> Selected Move:	7712	4	2	6	25400


> New Y[]: 
	
	 0  0  1  0  0  0  2  0  0  1  0  1  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 147 #######################


> Neighbours evaluated; 18
> Selected Move:	7592	3	12	7	25300


> New Y[]: 
	
	 0  0  1  0  0  0  2  3  0  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 148 #######################


> Neighbours evaluated; 8
> Selected Move:	7750	4	7	2	24300


> New Y[]: 
	
	 0  0  3  0  0  0  2  1  0  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 149 #######################


> Neighbours evaluated; 19
> Selected Move:	7750	4	6	7	24700


> New Y[]: 
	
	 0  0  3  0  0  0  1  2  0  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 150 #######################


> Neighbours evaluated; 12
> Selected Move:	7750	4	7	11	24900


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  0  1  0  2  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 151 #######################


> Neighbours evaluated; 21
> Selected Move:	7800	3	11	14	24300


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  0  1  0  0  0  0  2  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 152 #######################


> Neighbours evaluated; 16
> Selected Move:	7940	3	9	16	24800


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  0  0  0  0  0  0  2  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 153 #######################


> Neighbours evaluated; 28
> Selected Move:	7782	3	14	5	25400


> New Y[]: 
	
	 0  0  3  0  0  2  1  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 154 #######################


> Neighbours evaluated; 26
> Selected Move:	7730	3	5	9	25500


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  0  2  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 155 #######################


> Neighbours evaluated; 19
> Selected Move:	7673	4	9	19	25600


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  0  1  0  0  0  0  0  1  1  0  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 156 #######################


> Neighbours evaluated; 19
> Selected Move:	7560	4	19	15	25800


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  0  1  0  0  0  0  0  2  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 157 #######################


> Neighbours evaluated; 14
> Selected Move:	7621	3	15	10	25700


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  0  1  2  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 158 #######################


> Neighbours evaluated; 20
> Selected Move:	7562	4	10	6	25800


> New Y[]: 
	
	 0  0  3  0  0  0  2  1  0  1  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 159 #######################


> Neighbours evaluated; 24
> Selected Move:	7408	3	16	11	25800


> New Y[]: 
	
	 0  0  3  0  0  0  2  1  0  1  1  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 160 #######################


> Neighbours evaluated; 16
> Selected Move:	7461	4	6	10	25700


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  0  1  2  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 161 #######################


> Neighbours evaluated; 26
> Selected Move:	7352	3	2	17	25500


> New Y[]: 
	
	 0  0  0  0  0  0  1  1  0  1  2  1  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,58

## ITERATION 162 #######################


> Neighbours evaluated; 6
> Selected Move:	7292	4	10	6	25600


> New Y[]: 
	
	 0  0  0  0  0  0  2  1  0  1  1  1  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,585

## ITERATION 163 #######################


> Neighbours evaluated; 9
> Selected Move:	7540	3	10	15	24100


> New Y[]: 
	
	 0  0  0  0  0  0  2  1  0  1  0  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,59

## ITERATION 164 #######################


> Neighbours evaluated; 8
> Selected Move:	7700	3	11	16	24100


> New Y[]: 
	
	 0  0  0  0  0  0  2  1  0  1  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,595

## ITERATION 165 #######################


> Neighbours evaluated; 14
> Selected Move:	7700	4	6	7	24500


> New Y[]: 
	
	 0  0  0  0  0  0  1  2  0  1  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,6

## ITERATION 166 #######################


> Neighbours evaluated; 14
> Selected Move:	7700	4	7	16	24400


> New Y[]: 
	
	 0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  1  2  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,605

## ITERATION 167 #######################


> Neighbours evaluated; 11
> Selected Move:	7639	4	16	17	25100


> New Y[]: 
	
	 0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  1  3  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,61

## ITERATION 168 #######################


> Neighbours evaluated; 4
> Selected Move:	7700	4	16	6	25000


> New Y[]: 
	
	 0  0  0  0  0  0  3  1  0  1  0  0  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,615

## ITERATION 169 #######################


> Neighbours evaluated; 6
> Selected Move:	7700	4	6	7	24800


> New Y[]: 
	
	 0  0  0  0  0  0  1  3  0  1  0  0  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,61

## ITERATION 170 #######################


> Neighbours evaluated; 11
> Selected Move:	7700	3	7	12	24900


> New Y[]: 
	
	 0  0  0  0  0  0  1  0  0  1  0  0  3  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,605

## ITERATION 171 #######################


> Neighbours evaluated; 7
> Selected Move:	7700	4	12	17	24800


> New Y[]: 
	
	 0  0  0  0  0  0  1  0  0  1  0  0  2  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,6

## ITERATION 172 #######################


> Neighbours evaluated; 9
> Selected Move:	7640	4	12	6	25100


> New Y[]: 
	
	 0  0  0  0  0  0  2  0  0  1  0  0  1  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,595

## ITERATION 173 #######################


> Neighbours evaluated; 12
> Selected Move:	7540	3	17	4	25000


> New Y[]: 
	
	 0  0  0  0  3  0  2  0  0  1  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,59

## ITERATION 174 #######################


> Neighbours evaluated; 11
> Selected Move:	7540	4	6	12	24700


> New Y[]: 
	
	 0  0  0  0  3  0  1  0  0  1  0  0  2  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,585

## ITERATION 175 #######################


> Neighbours evaluated; 14
> Selected Move:	7540	4	4	12	24600


> New Y[]: 
	
	 0  0  0  0  2  0  1  0  0  1  0  0  3  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,58

## ITERATION 176 #######################


> Neighbours evaluated; 24
> Selected Move:	7540	3	12	7	24500


> New Y[]: 
	
	 0  0  0  0  2  0  1  3  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 177 #######################


> Neighbours evaluated; 14
> Selected Move:	7540	4	4	7	24400


> New Y[]: 
	
	 0  0  0  0  3  0  1  2  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 178 #######################


> Neighbours evaluated; 16
> Selected Move:	7540	4	7	6	24000


> New Y[]: 
	
	 0  0  0  0  3  0  2  1  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 179 #######################


> Neighbours evaluated; 20
> Selected Move:	7540	4	4	6	24700


> New Y[]: 
	
	 0  0  0  0  2  0  3  1  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 180 #######################


> Neighbours evaluated; 15
> Selected Move:	7540	4	6	16	24800


> New Y[]: 
	
	 0  0  0  0  2  0  1  1  0  1  0  0  0  0  0  1  3  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 181 #######################


> Neighbours evaluated; 11
> Selected Move:	7540	4	4	16	24300


> New Y[]: 
	
	 0  0  0  0  3  0  1  1  0  1  0  0  0  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 182 #######################


> Neighbours evaluated; 25
> Selected Move:	7430	4	16	9	25200


> New Y[]: 
	
	 0  0  0  0  3  0  1  1  0  2  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 183 #######################


> Neighbours evaluated; 18
> Selected Move:	7536	3	4	17	25300


> New Y[]: 
	
	 0  0  0  0  0  0  1  1  0  2  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,54

## ITERATION 184 #######################


> Neighbours evaluated; 12
> Selected Move:	7730	3	9	14	24600


> New Y[]: 
	
	 0  0  0  0  0  0  1  1  0  0  0  0  0  0  2  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,535

## ITERATION 185 #######################


> Neighbours evaluated; 21
> Selected Move:	7633	3	14	5	25200


> New Y[]: 
	
	 0  0  0  0  0  2  1  1  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,53

## ITERATION 186 #######################


> Neighbours evaluated; 16
> Selected Move:	7534	3	7	2	26200


> New Y[]: 
	
	 0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,525

## ITERATION 187 #######################


> Neighbours evaluated; 15
> Selected Move:	7540	3	16	11	26200


> New Y[]: 
	
	 0  0  1  0  0  2  1  0  0  0  0  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,53

## ITERATION 188 #######################


> Neighbours evaluated; 8
> Selected Move:	7633	3	5	16	25900


> New Y[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  1  2  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,535

## ITERATION 189 #######################


> Neighbours evaluated; 4
> Selected Move:	7896	4	16	2	25400


> New Y[]: 
	
	 0  0  2  0  0  0  1  0  0  0  0  1  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,54

## ITERATION 190 #######################


> Neighbours evaluated; 8
> Selected Move:	7786	4	2	6	25600


> New Y[]: 
	
	 0  0  1  0  0  0  2  0  0  0  0  1  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,545

## ITERATION 191 #######################


> Neighbours evaluated; 10
> Selected Move:	7750	3	6	0	24100


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,55

## ITERATION 192 #######################


> Neighbours evaluated; 25
> Selected Move:	7750	4	17	2	24300


> New Y[]: 
	
	 2  0  3  0  0  0  0  0  0  0  0  1  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,555

## ITERATION 193 #######################


> Neighbours evaluated; 29
> Selected Move:	7830	3	11	6	24300


> New Y[]: 
	
	 2  0  3  0  0  0  1  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,56

## ITERATION 194 #######################


> Neighbours evaluated; 51
> Selected Move:	7830	3	17	12	24300


> New Y[]: 
	
	 2  0  3  0  0  0  1  0  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,565

## ITERATION 195 #######################


> Neighbours evaluated; 41
> Selected Move:	7830	4	2	12	24400


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  0  0  0  0  3  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,57

## ITERATION 196 #######################


> Neighbours evaluated; 60
> Selected Move:	7660	3	12	7	24300


> New Y[]: 
	
	 2  0  1  0  0  0  1  3  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,565

## ITERATION 197 #######################


> Neighbours evaluated; 43
> Selected Move:	7660	4	7	2	23300


> New Y[]: 
	
	 2  0  3  0  0  0  1  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,56

## ITERATION 198 #######################


> Neighbours evaluated; 50
> Selected Move:	7780	3	15	10	24800


> New Y[]: 
	
	 2  0  3  0  0  0  1  1  0  0  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,555

## ITERATION 199 #######################


> Neighbours evaluated; 41
> Selected Move:	7613	4	2	10	25300


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  0  0  3  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,55

## ITERATION 200 #######################


> Neighbours evaluated; 44
> Selected Move:	7605	3	10	15	25100


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  0  0  0  0  0  0  0  3  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,545

## ITERATION 201 #######################


> Neighbours evaluated; 30
> Selected Move:	7660	4	15	6	24500


> New Y[]: 
	
	 2  0  1  0  0  0  3  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,54

## ITERATION 202 #######################


> Neighbours evaluated; 36
> Selected Move:	7660	4	6	16	24600


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  0  0  0  0  0  0  0  1  3  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,535

## ITERATION 203 #######################


> Neighbours evaluated; 45
> Selected Move:	7620	3	16	5	24700


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 204 #######################


> Neighbours evaluated; 28
> Selected Move:	7620	4	5	2	24800


> New Y[]: 
	
	 2  0  3  0  0  1  1  1  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 205 #######################


> Neighbours evaluated; 46
> Selected Move:	7450	3	6	16	24800


> New Y[]: 
	
	 2  0  3  0  0  1  0  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 206 #######################


> Neighbours evaluated; 45
> Selected Move:	7450	4	2	5	24700


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 207 #######################


> Neighbours evaluated; 46
> Selected Move:	7450	3	5	9	24700


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  3  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 208 #######################


> Neighbours evaluated; 39
> Selected Move:	7450	4	9	2	22800


> New Y[]: 
	
	 2  0  3  0  0  0  0  1  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 209 #######################


> Neighbours evaluated; 48
> Selected Move:	7760	3	7	3	24300


> New Y[]: 
	
	 2  0  3  1  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 210 #######################


> Neighbours evaluated; 27
> Selected Move:	7820	3	16	17	25300


> New Y[]: 
	
	 2  0  3  1  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 211 #######################


> Neighbours evaluated; 37
> Selected Move:	7730	3	3	16	23800


> New Y[]: 
	
	 2  0  3  0  0  0  0  0  0  1  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 212 #######################


> Neighbours evaluated; 31
> Selected Move:	7760	3	2	3	24000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  1  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,485
________________________________________________________________

Best solution found: 8180
Run Termination time: 03.02.2010 21:07:52
Run duration: 00:00:42.5937500
________________________________________________________________
